Maximal set

Results: 92



#Item
71Sage Reference Manual: Matroid Theory Release 6.6.beta0 The Sage Development Team

Sage Reference Manual: Matroid Theory Release 6.6.beta0 The Sage Development Team

Add to Reading List

Source URL: sagemath.org

Language: English - Date: 2015-02-21 07:35:22
72To appear in 13th International Conference on Computer Vision, 6-13 November 2011, Barcelona, Spain.  Image Segmentation by Figure-Ground Composition into Maximal Cliques Adrian Ion∗, Joao Carreira, Cristian Sminchises

To appear in 13th International Conference on Computer Vision, 6-13 November 2011, Barcelona, Spain. Image Segmentation by Figure-Ground Composition into Maximal Cliques Adrian Ion∗, Joao Carreira, Cristian Sminchises

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2014-06-04 23:25:00
73NP-complete problems / Clique / Network coding / Shortest path problem / Maximal independent set / Path decomposition / Graph theory / Theoretical computer science / Mathematics

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings Completion Delay Minimization for Instantly Decodable Networ

Add to Reading List

Source URL: www.comm.utoronto.ca

Language: English - Date: 2011-12-23 16:23:54
74Annals of Mathematics, [removed]), 439–485  On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra*

Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra*

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2006-04-11 06:21:40
75doi:[removed]j.tcs[removed]

doi:[removed]j.tcs[removed]

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-11-19 02:39:01
76Data Mining and Knowledge Discovery in Dynamic Networks Panos M. Pardalos Center for Applied Optimization Dept. of Industrial & Systems Engineering

Data Mining and Knowledge Discovery in Dynamic Networks Panos M. Pardalos Center for Applied Optimization Dept. of Industrial & Systems Engineering

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English - Date: 2006-10-30 15:12:10
77Maximal lattice-free convex sets in linear subspaces Amitabh Basu Carnegie Mellon University, [removed] Michele Conforti Universit`a di Padova, [removed] G´erard Cornu´ejols ∗

Maximal lattice-free convex sets in linear subspaces Amitabh Basu Carnegie Mellon University, [removed] Michele Conforti Universit`a di Padova, [removed] G´erard Cornu´ejols ∗

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2010-07-21 15:14:23
78A new trust region technique for the maximum weight clique problem Stanislav Busygin Industrial and Systems Engineering Department, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA

A new trust region technique for the maximum weight clique problem Stanislav Busygin Industrial and Systems Engineering Department, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA

Add to Reading List

Source URL: www.stasbusygin.org

Language: English - Date: 2009-02-11 00:35:51
79A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics ∗ Stanislav Busygin [removed] http://www.stasbusygin.org

A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics ∗ Stanislav Busygin [removed] http://www.stasbusygin.org

Add to Reading List

Source URL: www.stasbusygin.org

Language: English - Date: 2009-02-11 00:35:51
80General Conditions for Existence of Maximal Elements via the Uncovered Set  John Duggan Working Paper No. 563 July 2011

General Conditions for Existence of Maximal Elements via the Uncovered Set John Duggan Working Paper No. 563 July 2011

Add to Reading List

Source URL: rcer.econ.rochester.edu

Language: English - Date: 2011-09-10 11:05:00